Approximate Inverse Preconditioners for the Conjugate Gradient Method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method

We propose a method for preconditioner construction and parallel implementations of the Preconditioned Conjugate Gradient algorithm on GPU platforms. The preconditioning matrix is an approximate inverse derived from an algorithm for the iterative improvement of a solution to linear equations. Using a sparse matrix-vector product, our preconditioner is well suited for massively parallel GPU arch...

متن کامل

A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method

A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix A is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient calculations. It is proved that in exact arithmetic the preconditioner is well defined if A is an H-matrix. The results of numerical experiments are pre...

متن کامل

Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method

We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable to any symmetric positive definite matrix. The new preconditioner is breakdownfree and, when used in conjunction with the conjugate gradient method, results in a reliable solver for highly ill-conditioned linear systems. We also investigate an alternative approach to a stable approximate inverse...

متن کامل

Approximate Inverse Preconditioningfor the Conjugate Gradient

1. Introduction. In this note we consider the solution of large, sparse linear systems of

متن کامل

Parallel Approximate Inverse Preconditioners

There has been much excitement recently over the use of approximate inverses for parallel preconditioning. The preconditioning operation is simply a matrix-vector product, and in the most popular formulations, the construction of the approximate inverse seems embarassingly parallel. However, diiculties arise in practical parallel implementations. This paper will survey approximate inverse preco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Mathematics

سال: 2002

ISSN: 0020-7160,1029-0265

DOI: 10.1080/00207160210942